On lengths of words in context-free languages
نویسنده
چکیده
We consider slender languages, that is, languages for which the number of words of the same length is bounded from above by a constant. We prove that the slenderness problem is decidable for context-free languages and that the maximal number of words of the same length in a given context-free language is computable. Some e ective representations of slender context-free languages, as well as other related decidability problems are investigated.
منابع مشابه
Studying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملPrimitive Words Are Unavoidable for Context-Free Languages
We introduce the concept of unavoidability of languages with respect to a language class; this means that every language of the given class shares at least some word with the unavoidable language. Several examples of such unavoidabilities are presented. The most interesting one is that the set of primitive words is unavoidable for context-free languages that are not linear. 1 The Language of Pr...
متن کاملBinary Tree Code Words as Context-free Languages Binary Tree Code Words as Context-free Languages Erkki Mm Akinen
Given a binary tree coding system, the set of valid code words of all binary trees can be considered as a context-free language over the alphabet used in the coding system. The complexity of the language obtained varies from a coding system to another. Xiang, Tang and Ushijima have recently proved some properties of such languages. We show that their results can be more easily proved by noticin...
متن کاملOn Context-Free Languages of Scattered Words
It is known that if a Büchi context-free language (BCFL) consists of scattered words, then there is an integer n, depending only on the language, such that the Hausdorff rank of each word in the language is bounded by n. Every BCFL is a Müller context-free language (MCFL). In the first part of the paper, we prove that an MCFL of scattered words is a BCFL iff the rank of every word in the langua...
متن کاملLength Considerations in Context-Free Languages
In this paper we investigate languages containing at most a bounded number of words of each length. We rst show that the context-free languages for which the number of words of every length is bounded by a xed polynomial are exactly the bounded context-free languages in the sense of Ginsburg G]. Thus, we present a length characterization for bounded context-free languages. We then study slender...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 242 شماره
صفحات -
تاریخ انتشار 2000